Writing Reusable Digital Geometry Algorithms in a Generic Image Processing Framework

Digital Geometry software should reflect the generality of the underlying mathe- matics: mapping the latter to the former requires genericity. By designing generic solutions, one can effectively reuse digital geometry data structures and algorithms. We propose an image processing framework focused on the Generic Programming paradigm in which an algorithm on the paper can be turned into a single code, written once and usable with various input types. This approach enables users to design and implement new methods at a lower cost, try cross-domain experiments and help generalize resultsComment: Workshop on Applications of Discrete Geometry and Mathematical Morphology, Istanb : France (2010

Chaotic dynamics in a storage-ring Free Electron Laser

The temporal dynamics of a storage-ring Free Electron Laser is here investigated with particular attention to the case in which an external modulation is applied to the laser-electron beam detuning. The system is shown to produce bifurcations, multi-furcations as well as chaotic regimes. The peculiarities of this phenomenon with respect to the analogous behavior displayed by conventional laser sources are pointed out. Theoretical results, obtained by means of a phenomenological model reproducing the evolution of the main statistical parameters of the system, are shown to be in a good agreement with experiments carried out on the Super-ACO Free Electron Laser.Comment: submitted to Europ Phys. Journ.

Cellular Skeletons: A New Approach to Topological Skeletons with Geometric Features

This paper introduces a new kind of skeleton for binary volumes called the cellular skeleton. This skeleton is not a subset of voxels of a volume nor a subcomplex of a cubical complex: it is a chain complex together with a reduction from the original complex. Starting from the binary volume we build a cubical complex which represents it regarding 6 or 26-connectivity. Then the complex is thinned using the proposed method based on elementary collapses, which preserves significant geometric features. The final step reduces the number of cells using Discrete Morse Theory. The resulting skeleton is a reduction which preserves the homology of the original complex and the geometrical information of the output of the previous step. The result of this method, besides its skeletonization content, can be used for computing the homology of the original complex, which usually provides well shaped homology generators

Description of the topographical changes associated to the different stages of the DsbA catalytic cycle.

This paper provides a description of the surface topography of DsbA, the bacterial disulfide-bond forming enzyme, in the different phases of its catalytic cycle. Three representative states, that is, oxidized and reduced protein and a covalent complex mimicking the DsbA-substrate disulfide intermediate, have been investigated by a combination of limited proteolysis experiments and mass spectrometry methodologies. Protease-accessible sites are largely distributed in the oxidized form with a small predominance inside the thioredoxin domain. Proteolysis occurs even in secondary structure elements, revealing a significant mobility of the protein. Many cleavage sites disappear in the reduced form and most of the remaining ones appear with strongly reduced kinetics. The protein within the complex shows an intermediate behavior. This variation of flexibility in DsbA is probably the determining factor for the course of its catalytic cycle. In particular, the great mobility of the oxidized protein might facilitate the accommodation of its various substrates, whereas the increasing rigidity from the complexed to the reduced form could help the release of oxidized products. The formation of the complex between PID peptide and DsbA does not significantly protect the enzyme against proteolysis, reinforcing the results previously obtained by calorimetry concerning the weakness of their interaction. The few cleavage sites observed, however, are in favor of the presence of the peptide in the binding site postulated from crystallographic studies. As for the peptide itself, the proteolytic pattern and the protection effect exerted by DsbA could be explained by a preferential orientation within the binding site

The ARC-EN-CIEL radiation sources

MOPC005International audienceThe ARC-EN-CIEL (Accelerator-Radiation for Enhanced Coherent Intense Extended Light) project proposes a panoply of light sources for the scientific community on a 1 GeV superconducting LINAC (phase 2) on which two ERL loops (1 and 2 GeV) are added in phase 3. LEL1 (200-1.5 nm), LEL2 (10-0.5 nm) and LEL4 (2-0.2 nm) are three kHz High Gain Harmonic Generation Free Electron Laser sources seeded with the High order Harmonics generated in Gas, with 100-30 FWHM pulses. A collaboration, which has been set-up with the SCSS Prototype Accelerator in Japan to test this key concept of ARC-EN-CIEL, has led to the experimental demonstration of the seeding with HHG and the observation up the 7th non linear harmonic with a seed at 160 nm. LEL3 (40-8 nm) installed on the 1 GeV loop is a MHz FEL oscillator providing higher average power and brilliance. In addition, in vacuum undulator spontaneous emission source extend the spectral range above 10 keV and intense THz radiation is generated by edge radiation of bending magnets. Optimisations and light sources characteristics are described

Chaos in free electron laser oscillators

The chaotic nature of a storage-ring Free Electron Laser (FEL) is investigated. The derivation of a low embedding dimension for the dynamics allows the low-dimensionality of this complex system to be observed, whereas its unpredictability is demonstrated, in some ranges of parameters, by a positive Lyapounov exponent. The route to chaos is then explored by tuning a single control parameter, and a period-doubling cascade is evidenced, as well as intermittence.Comment: Accepted in EPJ

Fully Parallel Hyperparameter Search: Reshaped Space-Filling

Space-filling designs such as scrambled-Hammersley, Latin Hypercube Sampling and Jittered Sampling have been proposed for fully parallel hyperparameter search, and were shown to be more effective than random or grid search. In this paper, we show that these designs only improve over random search by a constant factor. In contrast, we introduce a new approach based on reshaping the search distribution, which leads to substantial gains over random search, both theoretically and empirically. We propose two flavors of reshaping. First, when the distribution of the optimum is some known $P_0$, we propose Recentering, which uses as search distribution a modified version of $P_0$ tightened closer to the center of the domain, in a dimension-dependent and budget-dependent manner. Second, we show that in a wide range of experiments with $P_0$ unknown, using a proposed Cauchy transformation, which simultaneously has a heavier tail (for unbounded hyperparameters) and is closer to the boundaries (for bounded hyperparameters), leads to improved performances. Besides artificial experiments and simple real world tests on clustering or Salmon mappings, we check our proposed methods on expensive artificial intelligence tasks such as attend/infer/repeat, video next frame segmentation forecasting and progressive generative adversarial networks

Average Curve of n Digital Curves

International audienc